- polynomial security
- bezpieczeństwo wątków
English-Polish dictionary of Electronics and Computer Science. 2013.
polynomial security
Look at other dictionaries:
Polynomial arithmetic — includes basic mathematical operations such as addition, subtraction, and multiplication. These operations are defined naturally as if the variable x was an element of S. Division is defined similarly, but requires that S be a field. Examples of… … Wikipedia
Security parameter — In cryptography, the security parameter is a variable that measures the input size of the problem. Both the resource requirements of the cryptographic algorithm or protocol as well as the adversary s probability of breaking security are expressed … Wikipedia
Semantic security — is a widely used definition for security in an asymmetric key encryption algorithm. For a cryptosystem to be semantically secure, it must be infeasible for a computationally bounded adversary to derive significant information about a message… … Wikipedia
Concrete security — In cryptography, concrete security or exact security is a practice oriented approach that aims to give more precise estimates of the computational complexities of adversarial tasks than polynomial equivalence would allow. Traditionally, provable… … Wikipedia
Ciphertext Indistinguishability — (Ununterscheidbarkeit von Geheimtexten) ist ein Begriff der bei Sicherheitsbeweisen von Verschlüsselungsverfahren verwendet wird. Bei einem Verfahren mit dieser Eigenschaft kann ein Angreifer nicht zwischen den Geheimtexten zweier Klartexte… … Deutsch Wikipedia
NTRUEncrypt — The NTRUEncrypt public key cryptosystem, also known as the NTRU encryption algorithm, is a lattice based alternative to RSA and ECC and is based on the shortest vector problem in a lattice (i.e. is not breakable using quantum computers).… … Wikipedia
Cyclic redundancy check — A cyclic redundancy check (CRC) is an error detecting code designed to detect accidental changes to raw computer data, and is commonly used in digital networks and storage devices such as hard disk drives. Blocks of data entering these systems… … Wikipedia
Fixed income attribution — refers to the process of measuring returns generated by various sources of risk in a fixed income portfolio, particularly when multiple sources of return are active at the same time. For example, the risks affecting the return of a bond portfolio … Wikipedia
Fixed-income attribution — refers to the process of measuring returns generated by various sources of risk in a fixed income portfolio, particularly when multiple sources of return are active at the same time. For example, the risks affecting the return of a bond portfolio … Wikipedia
Ciphertext indistinguishability — is a property of many encryption schemes. Intuitively, if a cryptosystem possesses the property of indistinguishability, then an adversary will be unable to distinguish pairs of ciphertexts based on the message they encrypt. The property of… … Wikipedia
Negligible function — For other uses, see negligible. In mathematics, a negligible function is a function such that for every positive integer c there exists an integer Nc such that for all x > Nc, Equivalently, we may also use the following definition. A … Wikipedia
